Multiple Coupon Interest Rate Futures Contracts

ABSTRACT

The disclosed system makes available multiple interest rate futures contracts (“IRFC”) for a given set of interest rate securities, such as US Treasury Notes, which may be used to satisfy the delivery obligation. The terms on which the delivery obligation of each such IRFC are met are governed by an associated conversion factor yield (“CFY”) value which is associated, in turn, with a corresponding set of conversion factors (“CF”), each of which corresponds to one member of the set of securities eligible for delivery, and which may be used at the time of delivery of such eligible interest rate security, to determine the delivery invoice price. Offering different CFY&#39;s and corresponding CF&#39;s may enable a market participant who seeks to use such futures to acquire or shed financial risk exposure to select from such array of futures contracts the member contract that most closely mirror the participant&#39;s intended risk profile.

REFERENCE TO RELATED APPLICATIONS

This application is a continuation under 37 C.F.R. §1.53(b) of U.S. patent application Ser. No. 13/291,618 filed Nov. 8, 2011 (Attorney Docket No. 4672/11009AUS) now U.S. Pat. No. ______, the entire disclosure of which is hereby incorporated by reference.

BACKGROUND

Interest rate futures contracts, and in particular, Treasury futures, are contracts to sell or buy debt instruments, such as U.S. Treasury bonds or notes, at a future date. Anyone holding a position in an expiring Treasury futures contract during its delivery month must be prepared to fulfill the contractual obligation to deliver, or to take delivery of, the underlying deliverable grade Treasury securities, discussed in more detail below. For this reason, delivery on contract—or the prospect of it—may be considered the chief determinant of prices at which Treasury futures trade.

Presently, the Treasury futures complex is neither intended nor organized to serve as a primary marketplace for the transfer of ownership of cash Treasury securities. Yet, the ever-present possibility of transfer via physical delivery means that futures contract prices are inextricably linked to cash market prices. Thus, physical delivery into Treasury futures may be considered, at once, infrequent yet pivotal.

Hedgers—those who use Treasury futures chiefly to lay off interest rate risk exposure rather than to acquire it—are seldom interested in using futures as a means of transacting Treasury securities. For this reason, hedgers typically liquidate their outstanding futures positions before the contracts enter their delivery cycle.

The majority of such liquidations are rolled. That is, the liquidating trades in the expiring contract are combined with trades that initiate corresponding new positions in the next following (or “deferred”) contract delivery month. For example, a market participant with an outstanding long position in an expiring futures contract would sell it, netting the position to zero. Simultaneously, the trader would establish a new long position in the deferred contract, equivalent in scale to the position in the expiring contract that the trader has just liquidated.

The practice of rolling is prevalent. Accordingly, only a small share of Treasury futures held by market participants may result in physical delivery—historically, around 3.6 percent. For the same reason, an expiring Treasury futures contract's open interest tends to have shrunk by half by the time the contract's physical delivery cycle commences.

The terms and conditions for each Treasury futures contract specify its deliverable grade, i.e., the securities that a short position holder may deliver at contract expiration for sale to a long position holder to fulfill the delivery obligation. These deliverable grade securities—Treasury notes and bonds—are debt instruments backed by the full faith and credit of the U.S. government. Under the current rules, any Treasury security may be tendered for delivery, as long as it meets the futures contract's criteria for delivery suitability. Typically, several securities are eligible and, from one contract expiry to the next, their number may vary with the frequency of issuance of notes and bonds by the U.S. Treasury.

For example, regarding Long Term U.S. Treasury Bond Futures, according to rule 40101.A. of the Chicago Board of Trade Rulebook, “[t]he contract grade for delivery on futures made under these Rules shall be U.S. Treasury fixed principal bonds which have fixed semi-annual coupon payments, and which have a remaining term to maturity of at least 25 years. For the purpose of determining a U.S. Treasury security's eligibility for contract grade, its remaining term to maturity shall be calculated from the first day of the contract's named month of expiration, and shall be rounded down to the nearest three-month increment (e.g., 12 years 5 months 18 days shall be taken to be 12 years 3 months). New issues of U.S. Treasury securities that satisfy the standards in this Rule shall be added to the contract grade as they are issued. Notwithstanding the foregoing, the Exchange shall have the right to exclude any new issue from the contract grade or to further limit outstanding issues from the contract grade.”

Further, with respect to Long Term U.S. Treasury Bond Futures, according to rule 40101.B. of the Chicago Board of Trade Rulebook, “[e]ach individual contract lot that is delivered must be composed of one and only one contract grade Treasury bond issue. The amount at which the short Clearing Member making delivery shall invoice the long Clearing Member taking delivery of said securities (Rule 40105.A.) shall be determined as:

Invoice Amount=($1000×P×c)+Accrued Interest

where

-   -   P is the contract daily settlement price on the day that the         short Clearing Member gives the Clearing House notice of         intention to deliver (Rule 40104.A.). P shall be expressed in         points and fractions of points with par on the basis of 100         points (Rule 40102.C.); and     -   c is a conversion factor equal to the price at which a security         with the same time to maturity as said security (as per Rule         40101.A.), and with the same coupon rate as said security, and         with par on the basis of one (1) point, will yield 6% per annum         according to conversion factor tables prepared and published by         the Exchange. For each individual contract lot that is         delivered, the product expression ($1000×P×c) shall be rounded         to the nearest cent, with half-cents rounded up to the nearest         cent. Example: Assume that P is 100 and 25/32nds. Assume that c         is 0.9633. The product expression ($1000×P×c) is found to be         $97,082.578125. The rounded amount that enters into         determination of the Invoice Amount is $97,082.58. In the         determination of the Invoice Amount for each individual contract         lot being delivered, Accrued Interest shall be charged to the         long Clearing Member taking delivery by the short Clearing         Member making delivery, in accordance with 31 CFR Part         306—General Regulations Governing U.S. Securities, Subpart         E—Interest.”

Regarding short term U.S. Treasury Note Futures, according to rule 21101.A. of the Chicago Board of Trade Rulebook, “[t]he contract grade for delivery on futures made under these Rules shall be U.S. Treasury fixed-principal notes which have fixed semi-annual coupon payments, and which have:

-   -   (a) an original term to maturity (i.e., term to maturity at         issue) of not more than 5 years 3 months; and     -   (b) a remaining term to maturity of not more than 2 years; and     -   (c) a remaining term to maturity of not less than 1 year 9         months.         For the purpose of determining a U.S. Treasury note's         eligibility for contract grade, its remaining term to maturity         shall be calculated from the first day of the contract's named         month of expiration, and shall be rounded down to the nearest         one-month increment (e.g., 1 year 10 months 17 days shall be         taken to be 1 year 10 months). New issues of U.S. Treasury notes         that satisfy the standards in this Rule shall be added to the         contract grade as they are issued. If the U.S. Treasury         Department auctions and issues a Treasury security that meets         these standards, such that said security is a re-opening of an         extant Treasury issue that had not previously met these         standards, then the extant Treasury issue shall be deemed to be         a Treasury note meeting these standards and shall be added to         the contract grade as of the issue date of said newly auctioned         Treasury security. Notwithstanding the foregoing, the Exchange         shall have the right to exclude any new issue from the contract         grade or to further limit outstanding issues from the contract         grade.”

Further, with respect to short term U.S. Treasury Note Futures, according to rule 21101.B of the Chicago Board of Trade Rulebook, “[e]ach individual contract lot that is delivered must be composed of one and only one contract grade Treasury note issue. The amount at which the short Clearing Member making delivery shall invoice the long Clearing Member taking delivery of said notes (Rule 21105.A.) shall be determined as:

Invoice Amount=($2000×P×c)+Accrued Interest

where

-   -   P is the contract daily settlement price on the day that the         short Clearing Member gives the Clearing House notice of         intention to deliver (Rule 21104.A.). P shall be expressed in         points and fractions of points with par on the basis of 100         points (Rule 21102.C.); and     -   c is a conversion factor equal to the price at which a note with         the same time to maturity as said note, and with the same coupon         rate as said note, and with par on the basis of one (1) point,         will yield 6% per annum according to conversion factor tables         prepared and published by the Exchange.         For each individual contract lot that is delivered, the product         expression ($2000×P×c) shall be rounded to the nearest cent,         with half-cents rounded up to the nearest cent. Example: Assume         that P is 100 and 25.5/32nds. Assume that c is 0.9633. The         product expression ($2000×P×c) is found to be $194,195.26259375.         The rounded amount that enters into determination of the Invoice         Amount is $194,195.26. In the determination n of the Invoice         Amount for each individual contract lot being delivered, Accrued         Interest shall be charged to the long Clearing Member taking         delivery by the short Clearing Member making delivery, in         accordance with 31 CFR Part 306—General Regulations Governing         U.S. Securities, Subpart E—Interest.”

With respect to Treasury Note and Bond futures listed for trading on the Chicago Board of Trade, updated U.S. Treasury Conversion Factors are periodically published by the Exchange.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a table for an exemplary cheapest-to-deliver security showing values for different coupons.

FIG. 2 shows a block diagram of an exemplary system 200 for facilitating settlement of a trade of an interest rate futures contract.

FIG. 3 shows a flow chart depicting exemplary operation of the system 200 of FIG. 2 for facilitating settlement of a trade of an interest rate futures contract.

FIG. 4 shows an illustrative embodiment of a general computer system for use with the exemplary system of FIG. 2.

DETAILED DESCRIPTION OF THE DRAWINGS AND PRESENTLY PREFERRED EMBODIMENTS

The disclosed embodiments relate to a system which makes available multiple interest rate futures contracts for a given set of interest rate securities, such as US Treasury Notes, which may be used to satisfy the delivery obligation. The terms on which the delivery obligation of each such interest rate futures contract are met are governed by an associated conversion factor yield value. Each conversion factor yield value is associated, in turn, with a corresponding set of conversion factors, each of which corresponds to one member of the set of securities eligible for delivery, and which may be used at the time of delivery of such eligible interest rate security, to determine the delivery invoice price, i.e. the price paid in exchange for delivery. Because the conversion factor yield and the corresponding set of conversion factors that apply to any one such interest rate futures contract may be different from the values applicable to other such futures contracts, it follows that for any given array of such futures contracts, any member of such array may differ from other members of such array in terms of the location of its market price in relation to contemporaneous market prices of the securities eligible for contract delivery. The resultant variety of price levels, in relation to prices of securities eligible for contract delivery, among the members of such array of multiple interest rate futures contracts may create beneficial flexibility for market participants, such that any market participant who seeks to use such futures to acquire or shed financial risk exposure may be enabled to select from such array of futures contracts the member contract that most closely mirror the participant's intended risk profile.

The disclosed embodiments further relate to mechanisms which allow traders to participate in the definition of the equivalent securities characterization of one or more of the interest rate futures contracts so as to ensure that desired products are made available without over-burdening the trading and clearing mechanisms of the Exchange which facilitates trading thereof. While the disclosed embodiments will be discussed with respect to Treasury Notes and Treasury Futures contracts, it will be appreciated that the disclosed embodiments may be applicable to any futures contracts for any interest rate security now available or later developed. Examples include, but are not limited to, contract for the future sale and purchase of sovereign government securities issued by the UK, Germany, France, Italy, Japan, or Spain; or securities issued by government sponsored enterprises such as the Federal Home Loan Mortgage Corporation, the Federal National Mortgage Association, or the Federal Home Loan Banks; or securities issued by supranational organizations such as the World Bank.

The rules which define the determination of the Treasury futures delivery invoice price for any instrument that qualifies to fulfill the delivery obligation of the treasury future short position holder are referred to as “the conversion factor (‘CF’) invoicing system.” The CF invoicing system is designed to accommodate the delivery of a wide range of Treasury securities against the contract. E.g., Treasury securities with remaining maturities ranging from 6-12 to 10 years may be eligible for delivery vs. 10-Year T-note futures, and Treasury securities with remaining maturities of 25 years or longer may be eligible for delivery vs. the Long-Term T-Bond futures contract. Thus, the short position holder may elect to make delivery of any of a range of securities that may vary widely in terms of both coupon and maturity. Because securities with varying coupon and maturities command different value in the market, the CF invoicing system is applied in an effort to normalize the value. The invoice price paid from long to short upon delivery of securities is the product of the prevailing futures price and the conversion factor:

Invoice Amount=(Futures Price×Conversion Factor)+Accrued Interest

(as exemplified above with respect to Long Term U.S. Treasury Bond Futures and short term U.S. Treasury Note Futures). In addition to the principle invoice amount, as determined by the product of the Futures Price and the appropriate Conversion Factor, the long position holder is required to compensate the short position holder for interest accrued since the last interest payment date for the security that is being tendered for delivery in fulfillment of contract.

The CF associated with a particular security, for delivery into a particular futures contract, may be calculated as the price of the security, in view of its coupon and maturity, to yield 6% on the first day of the futures contract delivery month. That 6% may be referred to as the “futures contract standard” or the conversion factor yield (“CF yield”) associated with the futures contract. The CF yield may be entirely arbitrary and may be generally established at levels that may or may not be reflective of current market conditions. However, conditions do change. For example, Chicago Board of Trade (“CBOT”) Treasury futures may currently utilize a 6% contract standard, whereas prior to the year 2000 they utilized an 8% contract standard. Insofar as the chief goal of the CF invoicing system is to render all deliverable-grade securities for a given futures contract approximately comparable in terms of their economic suitability for use in making delivery, the CF yield that determines such conversion factors ideally would equal the representative market yield among such deliverable-grade securities as of such futures contract's delivery month.

Ideally as well, application of the CF invoicing system would render equally economic the delivery of any eligible security. Practically, however, a single security typically stands out as the cheapest or most economic to deliver. As a general rule, when yields are in excess of the 6% futures contract standard, the cheapest-to-deliver (“CTD”) securities will be long duration (long maturity, low coupon) securities in comparison to other deliverable grade securities. When yields are less than the 6% futures contract standard, the CTD security will tend to be short duration (short maturity, high coupon) securities relative to other members of the contract grade. If market yields on securities that are eligible for delivery into the futures contract happen to be at or very close to the 6% futures contract standard, then these “conversion factor biases” are (theoretically) muted, and potentially several deliverable-grade securities may be equally economic to deliver.

Futures contracts tend to price, i.e. track or correlate, most closely with the CTD security. In a low yield environment, that implies that futures tend to price with reference to low duration securities, that may be considered to be the most seasoned of all of the futures contracts deliverable-grade securities. However, market participants are typically more interested in recently issued securities that are actively traded and that serve as the Treasury yield curve benchmarks. In this context, it will be appreciated that the “liquidity premium” associated with more recently auctioned Treasury securities tend to drive them to a price premium vs. seasoned securities.

The disclosed embodiments relate to multiple listings of Treasury futures contracts, with each contract subject to a distinct conversion factor yield, based upon any particular “delivery window.” For example, one may develop multiple Long-Term T-Bond (“Ultra”) T-bond futures contracts that call for the delivery of Treasuries with remaining term to maturity of 25 years or longer. For this set of contracts, in addition to the current 6% CF yield Ultra T-bond futures, 4% and 2% CF yield futures contracts may also be considered, noting that 30-year bonds currently yield in the vicinity of 3%. By offering Treasury contracts, each carrying a different CF yield, that, for example, “straddle” current market yields, assurance may be achieved that some such contracts will track long-duration securities while others will track short-duration securities.

The table shown in FIG. 1 illustrates this point by identifying an exemplary CTD security associated with 6%, 4%, and 2% CF yield futures contracts. This identification is accomplished by dividing the cash security prices of all securities eligible for delivery vs. the Ultra futures contract by their conversion factors. The CTD security is generally identified as the security with the lowest “adjusted futures price” (quoted in decimals). As shown in FIG. 1, predictably, the CTD security vs. the current 6% CF yield Ultra futures contract is the 4¾% of 2037. This is predictable because this security has a very low duration of only 15.0 years while yields are less than the 6% futures contract standard. But the CTD security vs. a hypothetical 2% coupon futures contract is the 3⅞% if 2040. This is likewise predictable, noting its long duration of 16.7 years and the fact that prevailing yields are greater than the hypothetical 2% CF yield.

In an alternative embodiment, it may be further possible to list a zero CF yield futures contract. Such a contract would have some interesting properties that may be attractive to various market participants. Specifically, the effective duration of such contract would almost always would reflect the duration of the of the deliverable grade security with longest duration. For example, application of L'Hospital's Rule to the CF formula results in a 0% CF being simply 1 plus the sum of the security's coupon stream over its remaining term to maturity. E.g., for a security with a coupon rate of 10 pct per annum and with 4 years of remaining term to maturity, the 0% CF is 1.4000, equal to 1+(4*0.1). If instead the security has 1 year 5 months of remaining term to maturity, then the 0% CF is 1.1417, equal to 1+((1+ 5/12)*0.1).

In yet another exemplary embodiment, the Exchange may maintain contracts with CF yields that consistently straddle current yields by applying a methodology analogous to the listing of option strike prices. Specifically, the Exchange may identify a standard CF yield interval, e.g., 2%, 1%, 0.5%, etc. If market yields associated with securities of a particular term to maturity should approach the highest or lowest currently listed CF yield level, a further futures contract with another CF yield could automatically be listed. For example, assume that the CF yield interval is established at 2% and that there are contracts available with CF yields at 2%, 4% and 6%. If market yields were to approach 6%, a further contract could be listed with conversion factors determined by a CF yield of 8%. Similarly, if market yields were to approach 2%, a further contract with conversion factors determined by a CF yield of 0%. Offering multiple futures with various CF yield values provides market participants with the option to utilize contracts (or combinations thereof) for which cheapest-to-deliver (or CTD) status, as discussed above, may attach to different members of the ensemble of securities that are eligible for delivery into such futures. For example, for a futures contract that is subject to a conversion factor yield that is low relative to market yields on the contract's deliverable-grade securities, the futures contract price would tend to track the price dynamics of members of the deliverable grade with relatively long duration. Conversely, for a futures contract that is subject to a conversion factor yield that is high relative to market yields on securities eligible for contract delivery, the contract price would tend to the track the price dynamics of members of the contract deliverable grade with relatively short durations This flexibility could offer significant opportunities in the context of risk management and basis trading strategies and is further consistent with the trend to offering customized products. While futures exchanges have typically attempted to offer standardized products that coalesce liquidity in a single market, the hallmark of the over-the-counter derivative markets is to provide the end user with significant flexibility, facilitated by the availability of cheap computing power.

To clarify the use in the pending claims and to hereby provide notice to the public, the phrases “at least one of <A>, <B>, . . . and <N>” or “at least one of <A>, <B>, . . . <N>, or combinations thereof” are defined by the Applicant in the broadest sense, superseding any other implied definitions herebefore or hereinafter unless expressly asserted by the Applicant to the contrary, to mean one or more elements selected from the group comprising A, B, . . . and N, that is to say, any combination of one or more of the elements A, B, . . . or N including any one element alone or in combination with one or more of the other elements which may also include, in combination, additional elements not listed.

FIG. 2 shows a block diagram of an exemplary system 200 for facilitating listing, trading and/or settlement of an interest rate futures contract that specifies a delivery obligation, which may be satisfied by at least the delivery of any one or more of a set of eligible interest rate securities within a specified delivery period which may occur subsequent to the undertaking thereof. Each of the set of eligible interest rate securities may be characterized by an associated coupon and an associated maturity which may be different from the coupon and maturities associated with the others of the set of eligible interest rate securities. The system 200 may be operated by an Exchange, such as the Chicago Board of Trade or the Chicago Mercantile Exchange, and may be implemented, such as by logic stored in a memory or other tangible computer readable medium and executable by a processor, in a computer, such as the computer 400 having a processor 402 and memory 404 discussed in more detail below. The system 200 includes an identification processor 202, which may be implemented as logic stored in the memory 404 and executable by the processor 402, operative to identify a set of unique conversion factor yields, each of which is associated with a set of conversion factors, each conversion factor associated with a different interest rate security of the set of eligible interest rate securities, which may be used, at a specified time of delivery of an eligible interest rate security of the set of eligible interest rate securities specified by an interest rate futures contract, to compute a price to be paid in exchange for the delivery thereof, the price being computed based on the conversion factor associated therewith. In one embodiment, the identification processor 202 is further operative to select those unique conversion factor yields for inclusion in the set of unique conversion factor yields which, for a particular market condition, a price dynamic of an associated interest rate futures contract, as a function of the unique conversion factor yield, approximates a price dynamic of any of the set of eligible interest rate securities. Each conversion factor of the set of conversion factors associated with a particular conversion factor yield may be computed as a price at which a note with the same time to maturity as the associated eligible interest rate security, and with par on the basis of one (1) point, will yield the associated conversion factor yield per annum.

The set of unique conversion factor yields may include all possible conversion factors, a subset thereof selected by a plurality of traders, such as by voting, and/or a set of unique conversion factor yields selected by other means, such as based on prevailing, extrapolated and/or predicted market conditions. It will be appreciated that while all unique conversion factor yields may be utilized, the large number of contracts created thereby may impact performance of the trading system and/or Exchange. Further, it will be appreciated that not all conversion factor yields may be desirable by traders. Accordingly, in one embodiment, the selection of the set of unique conversion factor yields is selective so as to reduce the computational and administrative load on the trading system and may be based on market/trader demand, as evidenced for example by a popular vote by participating traders, by prevailing market conditions, such as the current yields of the underlying interest rate securities, by predicted and/or extrapolated market conditions, such as the predicted or extrapolated yields for the underlying interest rate securities expected to be prevailing during the delivery period(s), and/or by other mechanisms to select a set of conversion factor yields. The identification processor 202 may further include logic to automatically select the set of unique conversion factor yields as described and may further update the set, continuously or periodically, as the underlying bases therefore change. For example, where the particular market condition comprises an ensemble of market yields to maturity, with one such yield applying to each member of the set of securities eligible for delivery into such futures contract of the selected interest rate security, the set of unique conversion factor yields may include a first conversion factor yield which is lower than the some or all of these market yields and a second conversion factor yield which is both higher than the first conversion factor yield and higher than some or all of the market yields. The system 200 may further include a market monitoring processor 208 which is operative to monitor changes in market conditions, such as via the Exchange 210, wherein the identification 202 and listing processors 204, described below, are further coupled with the market monitoring processor 208 and further operative to automatically identify the set of unique conversion factor yields and make the set of interest rate futures contracts available responsive to a change in market conditions.

The system 200 may also include a listing processor 204, which may also be implemented by logic stored in the memory 404 and executable by the processor 402, coupled with the identification processor 202 and operative to make a set of interest rate futures contracts available for trading, wherein each interest rate futures contract of the set specifies a delivery obligation which may be satisfied by delivery within a specified delivery period, of any one or more of a set of eligible interest rate securities, each interest rate futures contract of the set further characterized by one of the set of unique conversion factor yields and associated set of conversion factors to be used, at the time that the associated delivery obligation is satisfied, or substantially proximate thereto, at least by delivery and/or acceptance of an eligible interest rate security, to compute the price to be paid upon satisfaction of the delivery obligation thereof. Herein, the phrase “coupled with” is defined to mean directly connected to or indirectly connected through one or more intermediate components. Such intermediate components may include both hardware and software based components. The interest rate futures contracts may be communicated to the exchange 210 via a network (not shown), such as the network 420 shown in FIG. 4, as one or more data packets comprising one or more parameters describing or otherwise defining the contract in a manner in which the Exchange can list it for trading via an order book therefore.

The system 200 further includes a delivery processor 206, which may be implemented by logic stored in the memory 404 and executable by the processor 402, coupled with the identification processor 204 and operative, for a first trader having undertaken the specified delivery obligation of a traded interest rate futures contract of the set of interest rate futures contracts and a second trader obliged to pay the computed price therefore, to apply, at the time of delivery or substantially proximate thereto, e.g. upon delivery and acceptance, the conversion factor, of the set of conversion factors associated with the conversion factor yield specified by the traded interest rate futures contract, associated with an eligible interest rate security to be delivered to compute the price to be paid to the first trader upon satisfaction of the delivery obligation specified by the traded interest rate futures contract, the eligible interest rate security to be delivered having been selected by one of the first trader, the second trader, or a combination thereof from the set of eligible interest rate securities specified by the traded interest rate futures contract. It will be appreciated that the value of the selected eligible interest rate security at the time the traded interest rate futures contact is traded may be different then the value of the selected eligible interest rate security at the time of delivery.

The delivery processor 206 may be coupled with a clearing house 212 of the Exchange 210 to facilitate the delivery process of the particular interest rate security by transmitting, such as via the network 420, data indicative of the equivalent interest rate security(s) such that the clearing house 212 may determine that the obligated trader is meeting their delivery obligation.

It will be appreciated that the one or more eligible interest rate securities selected by the trader to be delivered may not be the lowest cost interest rate security of the set of the eligible interest rate securities. For example, the trader may have other motivations besides cost for making their selection or they may be ignorant of the cost of the selected securities as compared to other eligible interest rate securities.

FIG. 3 shows a flow chart depicting exemplary operation of the system 200 of FIG. 2 for facilitating listing, trading and settlement of an interest rate futures contract that specifies a delivery obligation, which may be satisfied by at least the delivery, e.g. subsequent to the undertaking thereof, of any one or more of a set of eligible interest rate securities within a specified delivery period, the method comprising. The operation of the system 200 includes: identifying, by a processor, such as the processor 402, a set of unique conversion factor yields, each of which is associated with a set of conversion factors, each conversion factor associated with a different interest rate security of the set of eligible interest rate securities, which may be used, at a specified time of delivery of an eligible interest rate security of the set of eligible interest rate securities specified by an interest rate futures contract, to compute a price to be paid in exchange for the delivery thereof, the price being computed based on the conversion factor associated therewith (block 302); making, by the processor, such as by the processor 402, a set of interest rate futures contracts available for trading, wherein each interest rate futures contract of the set specifies a delivery obligation which may be satisfied by delivery within a specified delivery period, of any of a set of eligible interest rate securities, each interest rate futures contract of the set further characterized by one of the set of unique conversion factor yields and associated set of conversion factors to be used, at the time that the associated delivery obligation is satisfied at least by delivery of an eligible interest rate security, to compute the price to be paid upon satisfaction of the delivery obligation thereof (block 304); and wherein for a first trader having undertaken the specified delivery obligation of a traded interest rate futures contract of the set of interest rate futures contracts and a second trader obliged to pay the computed price therefore, the operation further includes applying, by the processor, such as the processor 402, at the time of delivery, the conversion factor, of the set of conversion factors associated with the conversion factor yield specified by the traded interest rate futures contract, associated with an eligible interest rate security to be delivered to compute the price to be paid to the first trader upon satisfaction of the delivery obligation specified by the traded interest rate futures contract, the eligible one or more interest rate securities to be delivered having been selected by one of the first trader, the second trader, or a combination thereof from the set of eligible interest rate securities specified by the traded interest rate futures contract (block 306).

As discussed above, the set of unique conversion factor yields may include all possible conversion factors, a subset thereof selected by a plurality of traders, such as by voting, and/or a set of unique conversion factor yields selected by other means, such as based on prevailing, extrapolated and/or predicted market conditions. It will be appreciated that while all unique conversion factor yields may be utilized, the large number of contracts created thereby may impact performance of the trading system and/or Exchange. Further, it will be appreciated that not all conversion factor yields may be desirable by traders. Accordingly, in one embodiment, the selection of the set of unique conversion factor yields is selective so as to reduce the computational and administrative load on the trading system and may be based on market/trader demand, as evidenced for example by a popular vote by participating traders, by prevailing market conditions, such as the current yields of the underlying interest rate securities, by predicted and/or extrapolated market conditions, such as the predicted or extrapolated yields for the underlying interest rate securities expected to be prevailing during the delivery period(s), and/or by other mechanisms to select a set of conversion factor yields. The identification processor 202 may further include logic to automatically select the set of unique conversion factor yields as described and may further update the set, continuously or periodically, as the underlying bases therefore change. For example, where the particular market condition comprises an ensemble of market yields to maturity, with one such yield applying to each member of the set of securities eligible for delivery into such futures contract of the selected interest rate security, the set of unique conversion factor yields may include a first conversion factor yield which is lower than the some or all of these market yields and a second conversion factor yield which is both higher than the first conversion factor yield and higher than some or all of the market yields. The operation of the system 200 may further include monitoring, by the processor, such as the processor 402, changes in market conditions (block 308); and automatically performing, by the processor, such as by the processor 402, responsive to a change in market conditions, the identifying and making (block 310).

As discussed above, the one or more eligible interest rate securities selected by the trader to be delivered may not be the lowest cost interest rate security of the set of the eligible interest rate securities. For example, the trader may have other motivations besides cost for making their selection or they may be ignorant of the cost of the selected securities as compared to other eligible interest rate securities.

In one embodiment, the identifying may further include selecting those unique conversion factor yields for inclusion in the set of unique conversion factor yields which, for a particular market condition, a price dynamic of an associated interest rate futures contract, as a function of the unique conversion factor yield, approximates a price dynamic of any of the set of eligible interest rate securities.

Each conversion factor of the set of conversion factors associated with a particular conversion factor yield may be computed as a price at which a note with the same time to maturity as the associated eligible interest rate security, and with par on the basis of one (1) point, will yield the associated conversion factor yield per annum.

As discussed above, each of the set of eligible interest rate securities may be characterized by an associated coupon and an associated maturity which may be different from the coupon and maturities associated with the others of the set of eligible interest rate securities. Further, the value of the selected eligible interest rate security at the time the traded interest rate futures contract is traded may be different then the value thereof at the time of the delivery.

Referring to FIG. 4, an illustrative embodiment of a general computer system 400 is shown. The computer system 400 can include a set of instructions that can be executed to cause the computer system 400 to perform any one or more of the methods or computer based functions disclosed herein. The computer system 400 may operate as a standalone device or may be connected, e.g., using a network, to other computer systems or peripheral devices. Any of the components discussed above, such as the identification processor 202, listing processor 204, delivery processor 206 or market monitoring processor 208, may be a computer system 400 or a component in the computer system 400. The computer system 400 may implement a match engine 104 on behalf of an exchange, such as the Chicago Mercantile Exchange or Chicago Board of Trade, of which the disclosed embodiments are a component thereof.

In a networked deployment, the computer system 400 may operate in the capacity of a server or as a client user computer in a client-server user network environment, or as a peer computer system in a peer-to-peer (or distributed) network environment. The computer system 400 can also be implemented as or incorporated into various devices, such as a personal computer (PC), a tablet PC, a set-top box (STB), a personal digital assistant (PDA), a mobile device, a palmtop computer, a laptop computer, a desktop computer, a communications device, a wireless telephone, a land-line telephone, a control system, a camera, a scanner, a facsimile machine, a printer, a pager, a personal trusted device, a web appliance, a network router, switch or bridge, or any other machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine In a particular embodiment, the computer system 400 can be implemented using electronic devices that provide voice, video or data communication. Further, while a single computer system 400 is illustrated, the term “system” shall also be taken to include any collection of systems or sub-systems that individually or jointly execute a set, or multiple sets, of instructions to perform one or more computer functions.

As illustrated in FIG. 4, the computer system 400 may include a processor 402, e.g., a central processing unit (CPU), a graphics processing unit (GPU), or both. The processor 402 may be a component in a variety of systems. For example, the processor 402 may be part of a standard personal computer or a workstation. The processor 402 may be one or more general processors, digital signal processors, application specific integrated circuits, field programmable gate arrays, servers, networks, digital circuits, analog circuits, combinations thereof, or other now known or later developed devices for analyzing and processing data. The processor 402 may implement a software program, such as code generated manually (i.e., programmed).

The computer system 400 may include a memory 404 that can communicate via a bus 408. The memory 404 may be a main memory, a static memory, or a dynamic memory. The memory 404 may include, but is not limited to computer readable storage media such as various types of volatile and non-volatile storage media, including but not limited to random access memory, read-only memory, programmable read-only memory, electrically programmable read-only memory, electrically erasable read-only memory, flash memory, magnetic tape or disk, optical media and the like. In one embodiment, the memory 404 includes a cache or random access memory for the processor 402. In alternative embodiments, the memory 404 is separate from the processor 402, such as a cache memory of a processor, the system memory, or other memory. The memory 404 may be an external storage device or database for storing data. Examples include a hard drive, compact disc (“CD”), digital video disc (“DVD”), memory card, memory stick, floppy disc, universal serial bus (“USB”) memory device, or any other device operative to store data. The memory 404 is operable to store instructions executable by the processor 402. The functions, acts or tasks illustrated in the figures or described herein may be performed by the programmed processor 402 executing the instructions 412 stored in the memory 404. The functions, acts or tasks are independent of the particular type of instructions set, storage media, processor or processing strategy and may be performed by software, hardware, integrated circuits, firm-ware, micro-code and the like, operating alone or in combination. Likewise, processing strategies may include multiprocessing, multitasking, parallel processing and the like.

As shown, the computer system 400 may further include a display unit 414, such as a liquid crystal display (LCD), an organic light emitting diode (OLED), a flat panel display, a solid state display, a cathode ray tube (CRT), a projector, a printer or other now known or later developed display device for outputting determined information. The display 414 may act as an interface for the user to see the functioning of the processor 402, or specifically as an interface with the software stored in the memory 404 or in the drive unit 406.

Additionally, the computer system 400 may include an input device 416 configured to allow a user to interact with any of the components of system 400. The input device 416 may be a number pad, a keyboard, or a cursor control device, such as a mouse, or a joystick, touch screen display, remote control or any other device operative to interact with the system 400.

In a particular embodiment, as depicted in FIG. 4, the computer system 400 may also include a disk or optical drive unit 406. The disk drive unit 406 may include a computer-readable medium 410 in which one or more sets of instructions 412, e.g. software, can be embedded. Further, the instructions 412 may embody one or more of the methods or logic as described herein. In a particular embodiment, the instructions 412 may reside completely, or at least partially, within the memory 404 and/or within the processor 402 during execution by the computer system 400. The memory 404 and the processor 402 also may include computer-readable media as discussed above.

The present disclosure contemplates a computer-readable medium that includes instructions 412 or receives and executes instructions 412 responsive to a propagated signal, so that a device connected to a network 420 can communicate voice, video, audio, images or any other data over the network 420. Further, the instructions 412 may be transmitted or received over the network 420 via a communication interface 418. The communication interface 418 may be a part of the processor 402 or may be a separate component. The communication interface 418 may be created in software or may be a physical connection in hardware. The communication interface 418 is configured to connect with a network 420, external media, the display 414, or any other components in system 400, or combinations thereof. The connection with the network 420 may be a physical connection, such as a wired Ethernet connection or may be established wirelessly as discussed below. Likewise, the additional connections with other components of the system 400 may be physical connections or may be established wirelessly.

The network 420 may include wired networks, wireless networks, or combinations thereof. The wireless network may be a cellular telephone network, an 802.11, 802.16, 802.20, or WiMax network. Further, the network 420 may be a public network, such as the Internet, a private network, such as an intranet, or combinations thereof, and may utilize a variety of networking protocols now available or later developed including, but not limited to TCP/IP based networking protocols.

Embodiments of the subject matter and the functional operations described in this specification can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Embodiments of the subject matter described in this specification can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. While the computer-readable medium is shown to be a single medium, the term “computer-readable medium” includes a single medium or multiple media, such as a centralized or distributed database, and/or associated caches and servers that store one or more sets of instructions. The term “computer-readable medium” shall also include any medium that is capable of storing, encoding or carrying a set of instructions for execution by a processor or that cause a computer system to perform any one or more of the methods or operations disclosed herein. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, or a combination of one or more of them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.

In a particular non-limiting, exemplary embodiment, the computer-readable medium can include a solid-state memory such as a memory card or other package that houses one or more non-volatile read-only memories. Further, the computer-readable medium can be a random access memory or other volatile re-writable memory. Additionally, the computer-readable medium can include a magneto-optical or optical medium, such as a disk or tapes or other storage device to capture carrier wave signals such as a signal communicated over a transmission medium. A digital file attachment to an e-mail or other self-contained information archive or set of archives may be considered a distribution medium that is a tangible storage medium. Accordingly, the disclosure is considered to include any one or more of a computer-readable medium or a distribution medium and other equivalents and successor media, in which data or instructions may be stored.

In an alternative embodiment, dedicated hardware implementations, such as application specific integrated circuits, programmable logic arrays and other hardware devices, can be constructed to implement one or more of the methods described herein. Applications that may include the apparatus and systems of various embodiments can broadly include a variety of electronic and computer systems. One or more embodiments described herein may implement functions using two or more specific interconnected hardware modules or devices with related control and data signals that can be communicated between and through the modules, or as portions of an application-specific integrated circuit. Accordingly, the present system encompasses software, firmware, and hardware implementations.

In accordance with various embodiments of the present disclosure, the methods described herein may be implemented by software programs executable by a computer system. Further, in an exemplary, non-limited embodiment, implementations can include distributed processing, component/object distributed processing, and parallel processing. Alternatively, virtual computer system processing can be constructed to implement one or more of the methods or functionality as described herein.

Although the present specification describes components and functions that may be implemented in particular embodiments with reference to particular standards and protocols, the invention is not limited to such standards and protocols. For example, standards for Internet and other packet switched network transmission (e.g., TCP/IP, UDP/IP, HTML, HTTP, HTTPS) represent examples of the state of the art. Such standards are periodically superseded by faster or more efficient equivalents having essentially the same functions. Accordingly, replacement standards and protocols having the same or similar functions as those disclosed herein are considered equivalents thereof.

A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a standalone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).

Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and anyone or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Moreover, a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio player, a Global Positioning System (GPS) receiver, to name just a few. Computer readable media suitable for storing computer program instructions and data include all forms of non volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

To provide for interaction with a user, embodiments of the subject matter described in this specification can be implemented on a device having a display, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input.

Embodiments of the subject matter described in this specification can be implemented in a computing system that includes a back end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front end component, e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the subject matter described in this specification, or any combination of one or more such back end, middleware, or front end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (“LAN”) and a wide area network (“WAN”), e.g., the Internet.

The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

The illustrations of the embodiments described herein are intended to provide a general understanding of the structure of the various embodiments. The illustrations are not intended to serve as a complete description of all of the elements and features of apparatus and systems that utilize the structures or methods described herein. Many other embodiments may be apparent to those of skill in the art upon reviewing the disclosure. Other embodiments may be utilized and derived from the disclosure, such that structural and logical substitutions and changes may be made without departing from the scope of the disclosure. Additionally, the illustrations are merely representational and may not be drawn to scale. Certain proportions within the illustrations may be exaggerated, while other proportions may be minimized. Accordingly, the disclosure and the figures are to be regarded as illustrative rather than restrictive.

While this specification contains many specifics, these should not be construed as limitations on the scope of the invention or of what may be claimed, but rather as descriptions of features specific to particular embodiments of the invention. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a sub-combination or variation of a sub-combination.

Similarly, while operations are depicted in the drawings and described herein in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

One or more embodiments of the disclosure may be referred to herein, individually and/or collectively, by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any particular invention or inventive concept. Moreover, although specific embodiments have been illustrated and described herein, it should be appreciated that any subsequent arrangement designed to achieve the same or similar purpose may be substituted for the specific embodiments shown. This disclosure is intended to cover any and all subsequent adaptations or variations of various embodiments. Combinations of the above embodiments, and other embodiments not specifically described herein, will be apparent to those of skill in the art upon reviewing the description.

The Abstract of the Disclosure is provided to comply with 37 C.F.R. §1.72(b) and is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, various features may be grouped together or described in a single embodiment for the purpose of streamlining the disclosure. This disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter may be directed to less than all of the features of any of the disclosed embodiments. Thus, the following claims are incorporated into the Detailed Description, with each claim standing on its own as defining separately claimed subject matter.

It is therefore intended that the foregoing detailed description be regarded as illustrative rather than limiting, and that it be understood that it is the following claims, including all equivalents, that are intended to define the spirit and scope of this invention. 

We claim:
 1. A computer implemented method of facilitating settlement of an interest rate futures contract that specifies a delivery obligation which may be satisfied by at least the delivery of any of a set of eligible interest rate securities within a specified delivery period, the method comprising: computing, by a processor, a price to be paid in exchange for the delivery, in satisfaction of the delivery obligation of the interest rate futures contract, of a selected eligible interest rate security selected from the set of eligible interest rate securities each of which is associated with a unique conversion factor calculated to result in a particular conversion factor yield, of a set of conversion factor yields, specified by the interest rate futures contract within the specified delivery period, the price to be paid for the selected eligible interest rate security being computed based on the unique conversion factor associated therewith.
 2. The computer implemented method of claim 1 wherein the computing further comprises selecting those unique conversion factor yields for inclusion in the set of conversion factor yields which, for a particular market condition, a price dynamic of an associated interest rate futures contract, as a function of the unique conversion factor yield, approximates a price dynamic of any of the set of eligible interest rate securities.
 3. The computer implemented method of claim 1 wherein the selected eligible interest rate security selected from the set of eligible interest rate securities to be delivered is not the lowest cost interest rate security of the set of eligible interest rate securities.
 4. The computer implemented method of claim 1 wherein more than one eligible interest rate security of the set of eligible interest rate securities is selected to deliver in satisfaction of the delivery obligation.
 5. The computer implemented method of claim 1 wherein each conversion factor of the set of conversion factors which determine the unique conversion factor yield is computed as a price at which a note with the same time to maturity as the member of the set of eligible interest rate securities, and with par on the basis of one (1) point, will yield the unique conversion factor yield per annum.
 6. The computer implemented method of claim 1 wherein the specified delivery period occurs subsequent to the undertaking of the specified delivery obligation by a trader.
 7. The computer implemented method of claim 1 wherein each selected eligible interest rate security selected from the set of eligible interest rate securities is characterized by an associated coupon and an associated maturity.
 8. The computer implemented method of claim 7 wherein the coupon and maturity associated with the selected eligible interest rate security selected from the set of eligible interest rate securities may be different from the coupon and maturities associated with the others of the set of eligible interest rate securities.
 9. The computer implemented method of claim 7 wherein the value of the selected eligible interest rate security selected from the set of eligible interest rate securities at the time the traded interest rate futures contract is traded may be different then the value thereof at the time of the delivery.
 10. The computer implemented method of claim 1 wherein a particular market condition at a time of the computing comprises a yield of the selected eligible interest rate security selected from the set of eligible interest rate securities, the set of unique conversion factor yields including a first conversion factor yield lower than the yield of the selected eligible interest rate security selected from the set of eligible interest rate securities and a second conversion factor yield higher than the yield of the selected eligible interest rate security selected from the set of eligible interest rate securities.
 11. The computer implemented method of claim 10 further comprising: monitoring, by the processor, changes in market conditions; and automatically performing, by the processor responsive to a change in market conditions, the computing.
 12. The computer implemented method of claim 1 wherein the set of unique conversion factor yields comprises all possible conversion factor yields.
 13. The computer implemented method of claim 12 wherein the set of unique conversion factor yields comprises conversion factor yields selected by a plurality of traders from a set of traders.
 14. The computer implemented method of claim 13 wherein the selection of the set of unique conversion factor yields is accomplished by voting among the plurality of traders from the set of traders.
 15. A system for facilitating settlement of an interest rate futures contract that specifies a delivery obligation which may be satisfied by at least the delivery of any of a set of eligible interest rate securities within a specified delivery period, the system comprising: a delivery processor configured to compute a price to be paid in exchange for the delivery, in satisfaction of the delivery obligation of the interest rate futures contract, of a selected eligible interest rate security selected from the set of eligible interest rate securities each of which is associated with a unique conversion factor calculated to result in a particular conversion factor yield, of a set of conversion factor yields, specified by the interest rate futures contract within the specified delivery period, the price to be paid for the selected eligible interest rate security being computed based on the unique conversion factor associated therewith.
 16. The system of claim 15 wherein the delivery processor is further operative to select those unique conversion factor yields for inclusion in the set of unique conversion factor yields which, for a particular market condition, a price dynamic of an associated interest rate futures contract, as a function of the unique conversion factor yield, approximates a price dynamic of any of the set of eligible interest rate securities.
 17. The system of claim 15 wherein the selected eligible interest rate security selected from the set of eligible interest rate securities to be delivered is not the lowest cost interest rate security of the set of eligible interest rate securities.
 18. The system of claim 15 wherein more than one eligible interest rate security of the set of eligible interest rate securities is selected to deliver in satisfaction of the delivery obligation.
 19. The system of claim 15 wherein each conversion factor of the set of conversion factors associated with a unique conversion factor yield is computed as a price at which a note with the same time to maturity as the associated eligible interest rate security, and with par on the basis of one (1) point, will yield the associated conversion factor yield per annum.
 20. The system of claim 15 wherein the specified delivery period occurs subsequent to the undertaking of the specified delivery obligation by a trader.
 21. The system of claim 15 wherein each selected eligible interest rate security selected from the set of eligible interest rate securities is characterized by an associated coupon and an associated maturity.
 22. The system of claim 21 wherein the coupon and maturity associated with the selected eligible interest rate security selected from the set of eligible interest rate securities may be different from the coupon and maturities associated with the others of the set of eligible interest rate securities.
 23. The system of claim 21 wherein the value of the selected eligible interest rate security selected from the set of eligible interest rate securities at the time the traded interest rate futures contract is traded may be different then the value thereof at the time of the delivery.
 24. The system of claim 15 wherein a particular market condition at a time of the computation comprises a yield of the selected eligible interest rate security selected from the set of eligible interest rate securities, the set of unique conversion factor yields including a first conversion factor yield lower than the yield of the selected eligible interest rate security selected from the set of eligible interest rate securities and a second conversion factor yield higher than the yield of the selected eligible interest rate security selected from the set of eligible interest rate securities.
 25. The system of claim 24 further comprising: a market monitoring processor operative to monitor changes in market conditions; and wherein the computation processor is further coupled with the market monitoring processor and further operative to automatically compute the price to be paid in exchange for the delivery of an eligible interest rate security responsive to a change in market conditions.
 26. The system of claim 15 wherein the set of unique conversion factor yields comprises all possible conversion factor yields.
 27. The system of claim 26 wherein the set of unique conversion factor yields comprises conversion factor yields selected by a plurality of traders from a set of traders.
 28. The system of claim 27 wherein the selection of the set of unique conversion factor yields is accomplished by voting among the plurality of traders from the set of traders.
 29. A system for facilitating settlement of an interest rate futures contract that specifies a delivery obligation which may be satisfied by at least the delivery of any of a set of eligible interest rate securities within a specified delivery period, the system comprising: logic stored in a memory and executable by a processor to compute a price to be paid in exchange for the delivery, in satisfaction of the delivery obligation of the interest rate futures contract, of a selected eligible interest rate security selected from the set of eligible interest rate securities each of which is associated with a unique conversion factor calculated to result in a particular conversion factor yield, of a set of conversion factor yields, specified by the interest rate futures contract within the specified delivery period, the price to be paid for the selected eligible interest rate security being computed based on the unique conversion factor associated therewith.
 30. A system for facilitating settlement of an interest rate futures contract that specifies a delivery obligation which may be satisfied by at least the delivery of any of a set of eligible interest rate securities within a specified delivery period, the system comprising: means for computing a price to be paid in exchange for the delivery, in satisfaction of the delivery obligation of the interest rate futures contract, of a selected eligible interest rate security selected from the set of eligible interest rate securities each of which is associated with a unique conversion factor calculated to result in a particular conversion factor yield, of a set of conversion factor yields, specified by the interest rate futures contract within the specified delivery period, the price to be paid for the selected eligible interest rate security being computed based on the unique conversion factor associated therewith. 